能源互联网智能感知技术框架与应用布局

智能感知技术是数字化的关键技术之一,是能源互联网的基础技术。在当前数字化进程深入推动能源革命的背景下,智能感知技术已成为能源互联网建设与发展的数字引擎。文章总结了能源互联网框架下智能感知技术的战略背景、业务需求及重要意义,通过分析当前存在的问题,详细阐述了智能感知技术理论及发展趋势,梳理智能感知核心技术框架,提出系统性技术标准体系,并给出了能源互联网“源-网-荷-储”智能感知应用布局,最后结合我国能源互联网发展现状,对智能感知建设路径与发展方向进行了探讨与展望。     

有限元SN中子输运模拟的区域分解并行

确定论中子输运方法具有计算速度快、可获取物理量的精细场分布、可高效多物理耦合等优点，随着有限元方法在中子输运模拟中的应用，复杂几何结构、大尺度下的屏蔽问题和临界问题都能得到高保真建模和分析。离散纵标（S_N）法是求解中子输运方程的有效数值方法，基于OpenMP并行机制对各独立离散方向进行并行求解，可提高S_N输运模拟的计算速度，但并行规模较有限。对几何空间进行区域分解并采用MPI并行机制，可实现大规模并行扩展，进而实现对大型问题的高精度快速求解。本文采用并行自适应非结构网格应用框架JAUMIN进行区域分解和进程间通信，通过并行S_N扫描实现了自主有限元输运程序ENTER的高效并行，完成正确性检验后在天河Ⅱ号超级计算机上使用1 440个CPU核完成了1.43×10⁷网格单元、2.81×10⁹自由度规模问题的测试，计算时间约7.4 h。表明该程序具备了有效模拟大型复杂结构中子输运问题的能力，具有一定工程应用价值。     

大规模多状态计算系统的容错性能分析

针对异构计算节点组成的大规模多状态计算系统的容错性能分析问题，提出了一种计算系统容错性能的评估方法。该方法采用自定义的两级容错性能形式化描述框架进行系统描述，通过构造多值决策图（Multi-value Decision Diagram，MDD）模型对系统进行容错性能建模，并基于构造的模型高效地计算出部件故障的条件下计算系统在特定性能水平上运行的概率，减少了计算的冗余性。实验结果表明，该方法在模型的大小和构建时间上均优于传统方法。该方法的提出将对系统操作员或程序设计者具有重要意义，使其确保系统适合预期应用。     

Extraction of Distinguished Hyperbolic Trajectories for 2D Time-Dependent Vector Field Topology

This paper does two main contributions to 2D time-dependent vector field topology. First, we present a technique for robust, accurate, and efficient extraction of distinguished hyperbolic trajectories (DHT), the generative structures of 2D time-dependent vector field topology. It is based on refinement of initial candidate curves. In contrast to previous approaches, it is robust because the refinement converges for reasonably close initial candidates, it is accurate due to its adaptive scheme, and it is efficient due to its high convergence speed. Second, we provide a detailed evaluation and discussion of previous approaches for the extraction of DHTs and time-dependent vector field topology in general. We demonstrate the utility of our approach using analytical flows, as well as data from computational fluid dynamics.     

Usability of a cloud-based collaborative learning framework to improve learners’ experience

Computer-Supported Collaborative Learning (CSCL) is concerned with how Information and Communication Technology (ICT) might facilitate learning in groups which can be co-located or distributed over a network of computers such as Internet. CSCL supports effective learning by means of communication of ideas and information among learners, collaborative access of essential documents, and feedback from instructors and peers on learning activities. As the cloud technologies are increasingly becoming popular and collaborative learning is evolving, new directions for development of collaborative learning tools deployed on cloud are proposed. Development of such learning tools requires access to substantial data stored in the cloud. Ensuring efficient access to such data is hindered by the high latencies of wide-area networks underlying the cloud infrastructures. To improve learners’ experience by accelerating data access, important files can be replicated so a group of learners can access data from nearby locations. Since a cloud environment is highly dynamic, resource availability, network latency, and learner requests may change. In this paper, we present the advantages of collaborative learning and focus on the importance of data replication in the design of such a dynamic cloud-based system that a collaborative learning portal uses. To this end, we introduce a highly distributed replication technique that determines optimal data locations to improve access performance by minimizing replication overhead (access and update). The problem is formulated using dynamic programming. Experimental results demonstrate the usefulness of the proposed collaborative learning system used by institutions in geographically distributed locations.     

安全管理平台中基于云计算的日志分析系统设计

安全管理平台(SMP)是实现安全管理工作常态化运行的技术支撑平台,在实际应用中需要实时处理来自安全设备所产生的海量日志信息。为解决现有SMP中海量日志查询效率低下的问题,设计基于云计算的SMP日志存储分析系统。基于Hive的任务转化模式,利用Hadoop架构的分布式文件系统和MapReduce并行编程模型,实现海量SMP日志的有效存储与查询。实验结果表明,与基于关系数据的多表关联查询方法相比,该系统使得SMP日志的平均查询效率提高约90%,并能加快SMP集中管控的整体响应速度。     

Rules discovery in fuzzy classifier systems with PSO for scheduling in grid computational infrastructures

Particle swarm optimization (PSO) is a bio-inspired optimization strategy founded on the movement of particles within swarms. PSO can be encoded in a few lines in most programming languages, it uses only elementary mathematical operations, and it is not costly as regards memory demand and running time. This paper discusses the application of PSO to rules discovery in fuzzy classifier systems (FCSs) instead of the classical genetic approach and it proposes a new strategy, Knowledge Acquisition with Rules as Particles (KARP). In KARP approach every rule is encoded as a particle that moves in the space in order to cooperate in obtaining high quality rule bases and in this way, improving the knowledge and performance of the FCS. The proposed swarm-based strategy is evaluated in a well-known problem of practical importance nowadays where the integration of fuzzy systems is increasingly emerging due to the inherent uncertainty and dynamism of the environment: scheduling in grid distributed computational infrastructures. Simulation results are compared to those of classical genetic learning for fuzzy classifier systems and the greater accuracy and convergence speed of classifier discovery systems using KARP is shown.     

Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing

This study presents a simulation optimization approach for a hybrid flow shop scheduling problem in a real-world semiconductor back-end assembly facility. The complexity of the problem is determined based on demand and supply characteristics. Demand varies with orders characterized by different quantities, product types, and release times. Supply varies with the number of flexible manufacturing routes but is constrained in a multi-line/multi-stage production system that contains certain types and numbers of identical and unrelated parallel machines. An order is typically split into separate jobs for parallel processing and subsequently merged for completion to reduce flow time. Split jobs that apply the same qualified machine type per order are compiled for quality and traceability. The objective is to achieve the feasible minimal flow time by determining the optimal assignment of the production line and machine type at each stage for each order. A simulation optimization approach is adopted due to the complex and stochastic nature of the problem. The approach includes a simulation model for performance evaluation, an optimization strategy with application of a genetic algorithm, and an acceleration technique via an optimal computing budget allocation. Furthermore, scenario analyses of the different levels of demand, product mix, and lot sizing are performed to reveal the advantage of simulation. This study demonstrates the value of the simulation optimization approach for practical applications and provides directions for future research on the stochastic hybrid flow shop scheduling problem.     

A middleware framework for application-aware and user-specific energy optimization in smart mobile devices

Mobile battery-operated devices are becoming an essential instrument for business, communication, and social interaction. In addition to the demand for an acceptable level of performance and a comprehensive set of features, users often desire extended battery lifetime. In fact, limited battery lifetime is one of the biggest obstacles facing the current utility and future growth of increasingly sophisticated “smart” mobile devices. This paper proposes a novel application-aware and user-interaction aware energy optimization middleware framework (AURA) for pervasive mobile devices. AURA optimizes CPU and screen backlight energy consumption while maintaining a minimum acceptable level of performance. The proposed framework employs a novel Bayesian application classifier and management strategies based on Markov Decision Processes and Q-Learning to achieve energy savings. Real-world user evaluation studies on Google Android based HTC Dream and Google Nexus One smartphones running the AURA framework demonstrate promising results, with up to 29% energy savings compared to the baseline device manager, and up to 5×savings over prior work on CPU and backlight energy co-optimization.     

A privacy mechanism for mobile-based urban traffic monitoring

In mobile-based traffic monitoring applications, each user provides real-time updates on their location and speed while driving. This data is collected by a centralized server and aggregated to provide participants with current traffic conditions. Successful participation in traffic monitoring applications utilizing participatory sensing depends on two factors: the information utility of the estimated traffic condition, and the amount of private information (position and speed) each participant reveals to the server. We assume each user prefers to reveal as little private information as possible, but if everyone withholds information, the quality of traffic estimation will deteriorate. In this paper, we model these opposing requirements by considering each user to have a utility function that combines the benefit of high quality traffic estimates and the cost of privacy loss. Using a novel Markovian model, we mathematically derive a policy that takes into account the mean, variance and correlation of traffic on a given stretch of road and yields the optimal granularity of information revelation to maximize user utility. We validate the effectiveness of this policy through real-world empirical traces collected during the Mobile Century experiment in Northern California. The validation shows that the derived policy yields utilities that are very close to what could be obtained by an oracle scheme with full knowledge of the ground truth.